Generating Permutations on a VLSI Suitable Linear Network

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Algorithm for Generating Permutations on Linear Array

Given n items, a parallel algorithm for generating the n! permutations is presented. This algorithm is designed to run on a linear array consisting of n identical processing elements (PEs for short). These PEs are numbered and referred to as PE(i) for 1 < i < n. Each PE is responsible for producing one component of each permutation. Every PE(i) contains six registers, namely: C(i), T(i), K(i), ...

متن کامل

On Generating Permutations Under User-Defined Constraints

In this paper, a method to generate permutations of a string under a set of constraints decided by the user is presented. The required permutations are generated without generating all the permutations. Keywords— Permutations; Algorithm; Matrices; Constraints; Determinants Full Text: http://www.ijcsmc.com/docs/papers/February2014/V3I2201414.pdf

متن کامل

Generating SIMD Vectorized Permutations

This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator takes as input only the specification of the target platform’s SIMD vector ISA and the desired permutation. The...

متن کامل

Generating Permutations and Combinations

We consider permutations of {1, 2, . . . , n} in which each integer is given a direction; such permutations are called directed permutations. An integer k in a directed permutation is called mobile of its arrow points to a smaller integer adjacent to it. For example, for → 3 → 2 ← 5 → 4 → 6 → 1 , the integers 3, 5, and 6 are mobile. It follows that 1 can never be mobile since there is no intege...

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1989

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/32.6.571